Cellular Automata on Regular Rooted Trees
نویسندگان
چکیده
We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.
منابع مشابه
Algebras, Automata and Logic for Languages of Labeled Birooted Trees
In this paper, we study the languages of labeled finite birooted trees: Munn’s birooted trees extended with vertex labeling. We define a notion of finite state birooted tree automata that is shown to capture the class of languages that are upward closed w.r.t. the natural order and definable in Monadic Second Order Logic. Then, relying on the inverse monoid structure of labeled birooted trees, ...
متن کاملOn labeled birooted tree languages: Algebras, automata and logic
With an aim to developing expressive language theoretical tools applicable to inverse semigroup languages, that is, subsets of inverse semigroups, this paper explores the language theory of finite labeled birooted trees: Munn’s birooted trees extended with vertex labeling. To this purpose, we define a notion of finite state birooted tree automata that simply extends finite state word automata s...
متن کاملNon Linear Cellular Automata Enhanced with Active Learning for Pattern Classification in Highly Dense Images
This paper introduces a new approach to classify several high density images based on the properties of Non Linear Cellular Automata. We use a state-transition which consists of a set of disjoint trees rooted at cyclic states of unit cycle length thus forming a natural classifier. The framework proposed is strengthened with genetic algorithm to find the desired local rule of the modeling as a g...
متن کاملCS5236 – Advanced Automata Theory
Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then give insight into specific topics from the theory of automata theory. In computer science, automata are an important tool for many theoretical results and various types of automata have been used to characterise complexity classes. The lecture will give a deeper understandin...
متن کاملQuasi-Weak Cost Automata: A New Variant of Weakness
Cost automata have a finite set of counters which can be manipulated on each transition but do not affect control flow. Based on the evolution of the counter values, these automata define functions from a domain like words or trees to N ∪ {∞}, modulo an equivalence relation which ignores exact values but preserves boundedness properties. These automata have been studied by Colcombet et al. as p...
متن کامل